Sequential bargaining with pure common values

We study the alternating-offers bargaining problem of assigning an indivisible and commonly valued object to one of two players in return for some payment among players. The players are asymmetrically informed about the object’s value and have veto power over any settlement. There is no depreciation during the bargaining process which involves signalling of private information. We characterise the perfect Bayesian equilibrium of this game which is essentially unique if offers are required to be strictly increasing. Equilibrium agreement is reached gradually and nondeterministically. The better informed player obtains a rent

Labour market screening with intermediaries

We consider a Rothschild-Stiglitz-Spence labour market screening model and employ a centralised mechanism to coordinate the efficient matching of workers to firms. This mechanism can be thought of as operated by a recruitment agency, an employment office or head hunter. In a centralised descending-bid, multi-item procurement auction, workers submitwage-bids for each job and are assigned stable jobs as equilibrium outcome. We compare this outcome to independent, sequential hiring by firms and conclude that, in general, a stable assignment can only be implemented if firms coordinate to some extent

Sequential bargaining with pure common values and incomplete information on both sides

We study the alternating-offer bargaining problem of sharing a common value pie under incomplete information on both sides and no depreciation between two identical players. We characterise the essentially unique perfect Bayesian equilibrium of this game which turns out to be in gradually increasing offers

Labour market screening with intermediaries

We consider a Rothschild-Stiglitz-Spence labour market screening model and employ a centralised mechanism to coordinate the efficient matching of workers to firms. This mechanism can be thought of as operated by a recruitment agency, an employment office or head hunter. In a centralised descending-bid, multi-item procurement auction, workers submitwage-bids for each job and are assigned stable jobs as equilibrium outcome. We compare this outcome to independent, sequential hiring by firms and conclude that, in general, a stable assignment can only be implemented if firms coordinate to some extent.Matching; Multi-item auctions; Sequential auctions; Screening

Sequential bargaining with pure common values

We study the alternating-offers bargaining problem of assigning an indivisible and commonly valued object to one of two players in return for some payment among players. The players are asymmetrically informed about the object’s value and have veto power over any settlement. There is no depreciation during the bargaining process which involves signalling of private information. We characterise the perfect Bayesian equilibrium of this game which is essentially unique if offers are required to be strictly increasing. Equilibrium agreement is reached gradually and nondeterministically. The better informed player obtains a rent.Sequential bargaining; Common values; Incomplete information; Repeated games

Sequential bargaining with pure common values and incomplete information on both sides

We study the alternating-offer bargaining problem of sharing a common value pie under incomplete information on both sides and no depreciation between two identical players. We characterise the essentially unique perfect Bayesian equilibrium of this game which turns out to be in gradually increasing offers.Gradual bargaining; Common values; Incomplete information; Repeated games

When queueing is better than push and shove

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that existing property rights for the service are small enough to enable trade between the agents. In particular, we show on the one hand that no queue under a fully deterministic service schedule such as first-come, first-serve can be dissolved efficiently and meet our requirements. If, on the other hand, the alternative is service anarchy (ie. a random queue), every existing queue can be transformed into an efficient order

The efficient provision of public goods through non-distortionary tax contests

We use a simple balanced budget contest to collect taxes on a private good in order to ?nance a pure public good. We show that-with an appropriately chosen structure of winning probabilities-this contest can provide the public good efficiently and without distorting private consumption. We provide extensions to multiple public goods and private taxation sources, asymmetric preferences, and show the mechanism’s robustness across these settings

The optimal prize structure of symmetric Tullock contests

We show that the optimal prize structure of symmetric n-player Tullock tournaments assigns the entire prize pool to the winner, provided that a symmetric pure strategy equilibrium exists. If such an equilibrium fails to exist under the winner-take-all structure, we construct the optimal prize structure which improves existence conditions by dampening efforts. If no such optimal equilibrium exists, no symmetric pure strategy equilibrium induces positive efforts

When queueing is better than push and shove

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that existing property rights for the service are small enough to enable trade between the agents. In particular, we show on the one hand that no queue under a fully deterministic service schedule such as first-come, first-serve can be dissolved efficiently and meet our requirements. If, on the other hand, the alternative is service anarchy (ie. a random queue), every existing queue can be transformed into an efficient order.Scheduling; Queueing; Mechanism design